Lecture 15 — April 12 , 2012
نویسنده
چکیده
We care not only about the value of the minimum element, but also about the index k of the minimum element between A[i] and A[j]; given the index, it is easy to look up the actual value of the minimum element, so it is a more interesting problem to find the index of the minimum element between A[i] and A[j]. The range minimum query problem is not a tree problem, but it closely related to a tree problem (least common ancestor).
منابع مشابه
Lecture 15 — April 12 , 2012
In this lecture, we look at various data structures to solve problems about static trees: given a static tree, we perform some preprocessing to construct our data structure, then use the data structure to answer queries about the tree. The three problems we look at in this lecture are range minimum queries (RMQ), lowest common ancestors (LCA), and level ancestor (LA); we will support all these ...
متن کاملThe John A. Sweaney Lecture: Durbin, South Africa, April 2013, given by Dr Louis Sportelli. The 100 year test: can that tell us something?
The following is The John A. Sweaney Lecture delivered by Dr Louis Sportelli at the Biannual Assembly of the World Federation of Chiropractic in Durban, South Africa, on April 12, 2013.
متن کامل6 . 851 : Advanced Data Structures Spring 2012 Lecture 12 — April 3 , 2012
We continue our analysis of integer data structures, focusing this lecture on fusion trees. This structure employs some neat bit tricks and word-level parallelism. In particular, we discuss the following techniques necessary to understand the workings of a fusion tree: sketching, which allows certain w-bit words to be compressed to less than w bits, parallel comparison, where multiple words can...
متن کاملZB 2005: Formal Specification and Development in Z and B, 4th International Conference of B and Z Users, Guildford, UK, April 13-15, 2005, Proceedings
The zb 2005 formal specification and development in z and b 4th international conference of b and z users guildford uk april 13 15 2005 proceedings lecture notes in computer science that we provide for you will be ultimate to give preference. This reading book is your chosen book to accompany you when in your free time, in your lonely. This kind of book can help you to heal the lonely and get o...
متن کامل